Definition. [Pl1] Groups G1, G2 ∈ Θ are called X-equivalent if T ′′
ثبت نشده
چکیده
منابع مشابه
For the Course ” Introduction to Representation Theory ” , Fall 2015
Definition 1.1. A group G is a set with a binary operation G × G → G, called multiplication, such that (1) ∀f, g, h ∈ G.(fg)h = f(gh) (2) ∃1 ∈ Gs.t.∀g ∈ G, 1g = g1 = g (3) ∀g ∈ G, ∃g−1 ∈ Gs.t. gg−1 = g−1g = 1 A morphism of groups φ : G → H is a function φ : G → H s.t. φ(g1g2) = φ(g1)φ(g2)∀g1, g2 ∈ G. Example 1.2. Z the group of integers, Z/nZ = the cyclic group of order n, Sym(X)the group of al...
متن کاملAn Euler-type formula for median graphs
Let G be a median graph on n vertices and m edges and let k be the number of equivalence classes of the Djoković’s relation Θ defined on the edge-set of G. Then 2n − m − k ≤ 2. Moreover, 2n − m − k = 2 if and only if G is cube-free. A median graph is a connected graph such that, for every triple of vertices u, v, w, there is a unique vertex x lying on a geodesic (i.e. shortest path) between eac...
متن کاملNew Upper Bounds for Ramsey Numbers
The problem of determining Ramsey numbers is known to be very difficult. The few known exact values and several bounds for different G1, G2 or m, n are scattered among many technical papers (see [3]). A graph G with order p is called a (G1,G2; p)-graph ((m, n; p)-graph, resp.) if G does not contain a G1 and Ḡ does not contain a G2 (Km and Kn , resp.). It is easy to see that R(G1,G2) = p0 +1 iff...
متن کاملAn Ore-type analogue of the Sauer-Spencer Theorem
Two graphs G1 and G2 of order n pack if there exist injective mappings of their vertex sets into [n], such that the images of the edge sets do not intersect. Sauer and Spencer proved that if (G1) (G2) < 0.5n, then G1 and G2 pack. In this note, we study an Ore-type analogue of the Sauer–Spencer Theorem. Let θ(G) = max{d(u)+ d(v) : uv ∈ E(G)}. We show that if θ(G1) (G2) < n, then G1 and G2 pack. ...
متن کاملOn the q-Strong Diffie-Hellman Problem
This note is an exposition of reductions among the q-strong Diffie-Hellman problem and related problems. 1 The q-Strong Diffie-Hellman Problem We discuss reductions among the q-strong Diffie-Hellman (q-sDH) problem [1, 3] and related problems. We use the following notation: 1. G1 and G2 are two cyclic groups of prime order p. 2. g1 is a generator of G1 and g2 is a generator of G2. 3. ψ is an is...
متن کامل